Deductive rules in holographic reduced representation

نویسندگان

  • Vladimir Kvasnicka
  • Jiri Pospichal
چکیده

Holographic reduced representation is based on a suitable distributive coding of structured information in conceptual vectors, which elements satisfy normal distribution N(0,1/n). Existing applications of this approach concern various models of associative memory that exploit a simple algebraic operation of scalar product of distributed representations to measure an overlap between two structured concepts. This paper describes an inference process based on the rules modus ponens and modus tollens. r 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Default Databases: Extending the Approach of Deductive Databases Using Default Logic

Extending the relational data model using classical logic to give deductive databases has some signiicant beneets. In particular, classical logic rules ooer an eecient representation: a universally quantiied rule can represent many facts. However, classical logic does not support the representation of general rules, or synonymously defaults. General rules are rules that are usually valid, but o...

متن کامل

Declarative Rules for Annotated Expert Knowledge in Change Management

In this paper, we use declarative and domain–specific languages for representing expert knowledge in the field of change management in organisational psychology. Expert rules obtained in practical case studies are represented as declarative rules in a deductive database. The expert rules are annotated by information describing their provenance and confidence. Additional provenance information f...

متن کامل

Active-U-Datalog: Integrating Active Rules in a Logical Update Language

Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a practical technology, deductive rules have to be extended to provide a dynamic behavior. In particular, current applications require not only a support for updates and transactions but also the ability to automaticall...

متن کامل

Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases

The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reducing the complexity of formula evaluation at run-time. This paper proposes such a simplification method for large and semantically rich knowledge bases. Structural, temporal and assertional knowledge in the form of deduc...

متن کامل

O-DEVICE: An Object-Oriented Knowledge Base System for OWL Ontologies

This paper reports on the implementation of a rule system, called ODEVICE, for reasoning about OWL instances using deductive rules. O-DEVICE exploits the rule language of the CLIPS production rule system and transforms OWL ontologies into an object-oriented schema of COOL. During the transformation procedure, OWL classes are mapped to COOL classes, OWL properties to class slots and OWL instance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Neurocomputing

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2006